Что (кто) такое Huffman coding - определение

ENTROPY ENCODING ALGORITHM USED FOR LOSSLESS DATA COMPRESSION

Data compression/Huffman coding; Huffman encoding; Huffman code; Huffman tree; Huffman codes; Huffman Compression algorithm; Huffmann encoding; Hufman encoding; Huffmann coding; Hufman coding; Huffman Code; Huffman Compression; Huffman's algorithm; Hu-Tucker; Hu-Tucker coding; Huffman-Shannon-Fano coding; Huffman Coding; Huffman algorithm; Huffmann code; K-ary Huffman coding; K-ary Hufman encoding; Huffman’s algorithm; K-ary Huffman encoding; Coding tree; Static Huffman coding; Huffman Encoding; Huffman Decoding; Hoffman coding; Length-limited Huffman code; Length-limited Huffman coding; Minimum variance Huffman coding; Minimum variance Huffman code; Alphabetic Huffman tree; Alphabetic Huffman coding; Applications of Huffman coding; Huffmann decoding; Fixed-length Huffman code; Limited-length Huffman code

Huffman coding

<algorithm> A data compression technique which varies the length of the encoded symbol in proportion to its information content, that is the more often a symbol or token is used, the shorter the binary string used to represent it in the compressed stream. Huffman codes can be properly decoded because they obey the prefix property, which means that no code can be a prefix of another code, and so the complete set of codes can be represented as a binary tree, known as a Huffman tree. Huffman coding was first described in a seminal paper by D.A. Huffman in 1952. (1994-12-23)

Huffman code

Huffman coding

Huffman encoding

Huffman coding

Википедия

Huffman coding

In computer science and information theory, a Huffman code is a particular type of optimal prefix code that is commonly used for lossless data compression. The process of finding or using such a code proceeds by means of Huffman coding, an algorithm developed by David A. Huffman while he was a Sc.D. student at MIT, and published in the 1952 paper "A Method for the Construction of Minimum-Redundancy Codes".

The output from Huffman's algorithm can be viewed as a variable-length code table for encoding a source symbol (such as a character in a file). The algorithm derives this table from the estimated probability or frequency of occurrence (weight) for each possible value of the source symbol. As in other entropy encoding methods, more common symbols are generally represented using fewer bits than less common symbols. Huffman's method can be efficiently implemented, finding a code in time linear to the number of input weights if these weights are sorted. However, although optimal among methods encoding symbols separately, Huffman coding is not always optimal among all compression methods - it is replaced with arithmetic coding or asymmetric numeral systems if a better compression ratio is required.

https://en.wikipedia.org/wiki/Huffman coding